package leetcode.biweekly.week95;

//Solution3Test
public class Solution3 {
	public int xorBeauty(int[] nums) {
		int ans = 0;
		for (int num : nums) {
			ans ^= num;
		}
		return ans;
	}

}
